Pairwise balanced designs with block sizes 4 and 8
نویسنده
چکیده
Let K be a set of positive integers. A pairwise balanced design (PBD) of index unity B(K,l;v) is a pair (X/~) where X is a v-set (of points) and B is a collection of subsets of X (called blocks) with sizes from K such that every pair of distinct points of X is contained in exactly one block of~. A necessary condition for the existence of a PBD B({4,8},I;v) is v-0 or l(mod 4). It is shown that this necessary condition is also sufficient for all v ~ 4 with 11 exceptions and 25 possible exceptions of which 177 is the largest. We briefly mention some applications to other types of combinatorial structures.
منابع مشابه
Extremal Problems 2or Pairwise Balanced Designs
1 . Introduction In a previous paper [2] the senior author discussed many problems concerning block designs . Some of these have since been settled . Szemerédi and Trotter [5] showed, for example, that the number of pairwise balanced designs which can be obtained geometrically on n points in the plane with the blocks being the lines joining these points is at most exp(c/) . In [1] Colbourn, Phe...
متن کاملSome Pairwise Balanced Designs
A pairwise balanced design, B(K; v), is a block design on v points, with block sizes taken from K, and with every pair of points occurring in a unique block; for a fixed K, B(K) is the set of all v for which a B(K; v) exists. A set, S, is a PBD-basis for the set, T , if T = B(S). Let Na(m) = {n : n ≡ a mod m}, and N≥m = {n : n ≥ m}; with Q the corresponding restriction of N to prime powers. Thi...
متن کاملAn Improved Bound on the Cardinality of the Minimal Pairwise Balanced Designs on 18 Points with Maximum Block Size 4
The cardinality of the minimal pairwise balanced designs on v elements with largest block size k is denoted by g(k)(v). It is known that 31 ≤ g(4)(18) ≤ 33. In this paper we show that g(4)(18) 6= 31.
متن کاملResolvable balanced incomplete block designs with subdesigns of block size 4
In this paper, we look at resolvable balanced incomplete block designs on v points having blocks of size 4, briefly (v, 4, 1) RBIBDs. The problem we investigate is the existence of (v, 4, 1) RBIBDs containing a (w, 4, 1) RBIBD as a subdesign. We also require that each parallel class of the subdesign should be in a single parallel class of the containing design. Removing the subdesign gives an i...
متن کاملExistence of OBIBDs with k=4 with and without nesting
Methods developed for the recursive construction of sets of balanced incomplete block designs with adjusted orthogonality (OBIBDs) are applied to designs with block size 4, with 2 sets of treatments. The methods are extended to include designs with blocks of size 4 nested into sub-blocks of size 2. We also complete the existence results of Greig and Rees for OBIBDs with block size 3 and 2 sets ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 2 شماره
صفحات -
تاریخ انتشار 1990